Parametric and Non Homogeneous Semi-Markov Process for HIV Control

In AIDS control, physicians have a growing need to use pragmatically useful and interpretable tools in their daily medical taking care of patients. Semi-Markov process seems to be well adapted to model the evolution of HIV-1 infected patients. In this study, we introduce and define a non homogeneous semi-Markov (NHSM) model in continuous time. Then the problem of finding the equations that describe the biological evolution of patient is studied and the interval transition probabilities are computed. A parametric approach is used and the maximum likelihood estimators of the process are given. A Monte Carlo algorithm is presented for realizing non homogeneous semi-Markov trajectories. As results, interval transition probabilities are computed for distinct times and follow-up has an impact on the evolution of patients.      

阴极还原处理对多孔硅发光性能的影响

对经过阴极还原处理后的多孔硅样片进行了光致发光测试和稳定性测试.实验结果表明这种处理能明显改善多孔硅的发光稳定性,使其表面结构更加稳定.利用原子力显微镜对不同还原时间的多孔硅微结构及形貌进行了比较,在一定范围内随着还原时间的增长多孔硅表面粗糙度增大,PL谱增强.     

Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered.     

Time Consistent Dynamic Risk Measures

We introduce the time-consistency concept that is inspired by the so-called “principle of optimality” of dynamic programming and demonstrate – via an example – that the conditional value-at-risk (CVaR) need not be time-consistent in a multi-stage case. Then, we give the formulation of the target-percentile risk measure which is time-consistent and hence more suitable in the multi-stage investment context. Finally, we also generalize the value-at-risk and CVaR to multi-stage risk measures based on the theory and structure of the target-percentile risk measure.     

Local existence for the one‐dimensional Vlasov–Poisson system with infinite mass

A collisionless plasma is modelled by the Vlasov–Poisson system in one dimension. We consider the situation in which mobile negative ions balance a fixed background of positive charge, which is independent of space and time, as ∣x∣ → ∞. Thus, the total positive charge and the total negative charge are both infinite. Smooth solutions with appropriate asymptotic behaviour are shown to exist locally in time, and criteria for the continuation of these solutions are established. Copyright © 2006 John Wiley & Sons, Ltd.     

Quantum Dot and Antidot Infrared Photodetectors: Iterative Methods for Solving the Laplace Equation in Domains with Involved Geometry

We propose iteration methods for solving the Dirichlet problem in domains with involved geometry. Such problems arise in relation to the problem of optimizing quantum dot and antidot infrared detectors. We estimate the deviation of an approximate solution from the exact solution.     

Approximating schedules for dynamic process graphs efficiently

A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.

In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.

In this paper we study a subclass of dynamic process graphs called -output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is -complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a -complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion.     

正交变换在重积分中某些应用

正交变换是代数学的基本内容 ,其用途十分广泛 .重积分的计算往往存在技术性的困难 ,若利用“正交变换”的有关理论去解决某些重积分的计算问题是颇有功效的 .本文将以“正交变换”为工具 ,简洁的处理重积分的某些问题     

群胚上的Dirac结构及泊松约化

本文详细讨论了李双代数胚中的Dirac结构、群胚上的Dirac结构。利用Dirac结构的特征对的概念,给出了作用不变Dirac结构,拉回Dirac结构等概念的新的刻画。最后利用Dirac结构的有关性质,讨论了泊松齐性空间和泊松群胚作用的约化。